package top.lcm668.study.oj.base.sortmethods;

import java.util.Comparator;
import java.util.PriorityQueue;

/**
 * @author: Coder-Lcm
 * @date: 2021/10/5 18:04
 * 堆排序
 */
public class HeapSort<T extends Comparable<T>> extends BaseSort<T> {
    /**
     * todo
     * @param arr
     * @param isAsc 默认升序排列
     */
    @Override
    protected void sort(T[] arr, boolean isAsc) {
        PriorityQueue<Integer> priorityQueue
                = new PriorityQueue<>((o1, o2) ->
                o2.compareTo(o1)
        );
    }
}
